Remarks on Semantic Completeness for Proof-terms with Laird’s Dual Affine/Intuitionistic λ-calculus
نویسندگان
چکیده
The purpose of this note is to give a demonstration of the completeness theorem of type assignment system for λ-terms of [Hindley 83] and [Coquand 05] with two directions of slight extensions. Firstly, using the idea of [Okada 96], [Okada-Terui 99] and [Hermant-Okada 07], we extend their completeness theorem to a stronger form which implies a normal form theorem. Secondly, we extend the simple type (the implicational fragment of intuitionistic logic) framework of [Hindley 83] and [Coquand 05] to a linear (affine) types (the {−◦, &,→}-fragment of affine logic) framework of [Laird 03, 05].
منابع مشابه
Characterising Strongly Normalising Intuitionistic Terms
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. Next...
متن کاملContextual Natural Deduction
This paper defines the contextual natural deduction calculus ND for the implicational fragment of intuitionistic logic. ND extends the usual natural deduction calculus (here called ND) by allowing the implication introduction and elimination rules to operate on formulas that occur inside contexts. In analogy to the Curry-Howard isomorphism between ND and the simply-typed λ-calculus, an extensio...
متن کاملKripke semantics and proof systems for combining intuitionistic logic and classical logic
We combine intuitionistic logic and classical logic into a new, first-order logic called Polarized Intuitionistic Logic. This logic is based on a distinction between two dual polarities which we call red and green to distinguish them from other forms of polarization. The meaning of these polarities is defined model-theoretically by a Kripke-style semantics for the logic. Two proof systems are a...
متن کاملIntuitionistic Completeness of First-Order Logic – mPC Case
We constructively prove in type theory the completeness of the minimal Propositional Calculus, showing that a formula is provable in mPC if and only if it is uniformly valid in constructive type theory extended with the intersection operator. Our completeness proof provides an effective procedure Prf that converts any uniform evidence into a formal an mPC proof. Mark Bickford has implemented Pr...
متن کاملA Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
We propose a term assignment (let calculus) for Intuitionistic Logic for Pragmatics ILPAC, a polarized sequent calculus which includes ordinary positive intuitionistic logic LJ, its dual LJ and dual negations ( ) which allow a formula to “communicate” with its dual fragment. We prove the strong normalization property for the term assignment which follows by soundly translating the let calculus ...
متن کامل